package algotithm.leetcode.dp.test62;

/**
 * @author zhouyanxiang
 * @Date 2021-03-2021/3/26-23:55
 */
public class Solution {

    public static void main(String[] args) {
        int m = 7;
        int n = 3;
        Solution solution = new Solution();
        int uniquePaths = solution.uniquePaths(m, n);
        System.out.println(uniquePaths);
    }

    public int uniquePaths(int m, int n) {
        int[][] f = new int[m][n];
        for (int i = 0; i < m; i++) {
            f[i][0] = 1;
        }
        for (int j = 0; j < n; j++) {
            f[0][j] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                f[i][j] = f[i-1][j] + f[i][j-1];
            }
        }
        return f[m-1][n-1];
    }

}
